A Cooperative P2p Refueling Strategy for Circular Satellite Constellations

نویسندگان

  • Atri Dutta
  • Panagiotis Tsiotras
چکیده

In this paper, we discuss the problem of peer-to-peer (P2P) refueling of satellites in a circular constellation. In particular, we propose a cooperative P2P (C-P2P) refueling strategy, in which the satellites involved in P2P maneuvers are allowed to engage in cooperative rendezvous. We discuss a formulation of the proposed C-P2P strategy and a methodology to determine the optimal C-P2P assignments. We show that in order to reduce the fuel expenditure in a C-P2P maneuver, the amount of fuel exchanged between the two satellites is such that the satellite performing the larger-ΔV transfer during the return trip, ends up having just enough amount of fuel to be fuel-sufficient. Finally, with the help of numerical examples, we provide a comparison of the P2P and the C-P2P refueling strategies. It is found that a C-P2P strategy is beneficial when the fuel-deficient satellites in the constellation do not have enough fuel to complete a non-cooperative rendezvous.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Peer-to-Peer Refueling for Circular Satellite Constellations

In this paper, we study the scheduling problem arising from refueling multiple satellites in a circular constellation. It is assumed that there is no fuel delivered to the constellation from an external source. Instead, all satellites in the constellation are assumed to be capable of refueling each other (peer-to-peer refueling). The total time to complete the rendezvous maneuvers including the...

متن کامل

Aas 05-474 Asynchronous Optimal Mixed P2p Satellite Refueling Strategies

In this paper, we study pure peer-to-peer (henceforth abbreviated as P2P) and mixed (combined single-spacecraft and P2P) satellite refueling in circular orbit constellations comprised of multiple satellites. We consider the optimization of two conflicting objectives in the refueling problem and show that the cost function we choose to determine the optimal refueling schedule reflects a reasonab...

متن کامل

(Preprint) AAS 09-392 A PEER-TO-PEER REFUELING STRATEGY USING LOW-THRUST PROPULSION

The problem of minimum-fuel, time-fixed, low-thrust rendezvous is addressed with the particular aim of developing a solver to determine optimal low-thrust Peer-to-Peer (P2P) maneuvers, which will be an integral part of distributed lowthrust servicing missions for multiple satellites. We develop the solver based on an indirect optimization technique and utilize the well-known shooting method to ...

متن کامل

Aas 07-151 a Network Flow Formulation for an Egalitarian P2p Satellite Refueling Strategy

A variation of the P2P strategy, known as egalitarian P2P (E-P2P) refueling strategy, relaxes the restriction on the active satellites to return to their original orbital slots after undergoing the fuel transactions. The E-P2P refueling problem can be formulated as a three-index assignment problem on an undirected tripartite constellation graph, which can be solved using, say, a Greedy Random A...

متن کامل

An Auction Algorithm for Optimal Satellite Refueling

Satellite refueling can extend the lifetime of satellite constellations. Peer-to-peer satellite refueling in particular has the potential to make the most efficient use of the fuel contained in the constellation by redistributing it as on a need-to basis. In this paper we present an alternative implementation of P2P refueling, namely pairing up fuel sufficient satellites with fuel deficient sat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008